منابع مشابه
Weak-Order Extensions of an Order
In this paper, at rst we describe a graph representing all the weak-order extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weak-order extensions of a partially ordered set, and implying a generation algorithm. Finally, we prove that the number of weak-order extensions of a partially ordered set is a comparability inv...
متن کاملAn alternative characterization of weak order dependence
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that can cater for reactive programs with their necessarily non–terminating computations. One important such definition is the definition of Weak Order Dependence, which was introduced to generalize classical control dependenc...
متن کاملCyclic Extensions of Order Varieties
It is known that the problem of telling whether a cyclic order is included in some cycle is NP-complete. We show that the same question for order varieties, a special class of cyclic orders, is in L. For this, we relate the entropy relation between partial orders to the forcing relation of graph theory.
متن کاملasymptotic property of order statistics and sample quntile
چکیده: فرض کنید که تابعی از اپسیلون یک مجموع نامتناهی از احتمالات موزون مربوط به مجموع های جزئی براساس یک دنباله از متغیرهای تصادفی مستقل و همتوزیع باشد، و همچنین فرض کنید توابعی مانند g و h وجود دارند که هرگاه امید ریاضی توان دوم x متناهی و امیدریاضی x صفر باشد، در این صورت می توان حد حاصلضرب این توابع را بصورت تابعی از امید ریاضی توان دوم x نوشت. حالت عکس نیز برقرار است. همچنین ما با استفاده...
15 صفحه اولWeak order polytopes
The weak order polytope P n WO is the polytope in R n(n?1) whose ver-tices correspond to the members of the family of reeexive weak orders on f1; 2 : : : ; ng when each coordinate of R n(n?1) is associated with a diierent ordered pair (i; j) of distinct points in f1; 2; : : : ; ng. The vertex w that corresponds to weak order W has w (i;j) = 1 if i-j in W and has w (i;j) = 0 otherwise, with P n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00132-4